Revised Slide Window First Algorithm for Advanced Reservation in Optical Grid

For utilizing distributed resources in optical grid environment advanced reservations play a very crucial role. For applications like the co-allocation of distributed resources and deadline driven applications advance reservations are essential. Also for enhancing capabilities of resource brokers advance reservations play a major role. The objective is to determine a scheduling algorithm that minimizes the blocking probability, i.e. the probability of not scheduling a request within its window, minimizes reservation delay and maximizes network utilization. In this paper, we proposed revision of Slide Window First (RSWF) algorithm. Also the comparison has been done depending on parameters such as reservation delay, blocking probability, link utilization and so on with Slide Window First (SWF) algorithm. Here, RSWF algorithm checks one path at a time for all of the scheduling window slots. If a path cannot be reserved during the scheduling window, the next shortest path is checked. In this, Parallel Dijkstra’s algorithm is used for finding the shortest path.